An improved water-filled impedance tube

A water-filled impedance tube capable of improved measurement accuracy and precision is reported. The measurement instrument employs a variation of the standardized two-sensor transfer function technique. Performance improvements were achieved through minimization of elastic waveguide effects and through the use of sound-hard wall-mounted acoustic pressure sensors. Acoustic propagation inside the water-filled impedance tube was found to be well described by a plane wave model, which is a necessary condition for the technique. Measurements of the impedance of a pressure-release terminated transmission line, and the reflection coefficient from a water/air interface, were used to verify the system.     

Development and validation of a SUPG finite element scheme for the compressible Navier–Stokes equations using a modified inviscid flux discretization

This paper considers the streamline‐upwind Petrov–Galerkin (SUPG) method applied to the unsteady compressible Navier–Stokes equations in conservation‐variable form. The spatial discretization, including a modified approach for interpolating the inviscid flux terms in the SUPG finite element formulation, and the second‐order accurate time discretization are presented. The numerical method is discussed in detail. The performance of the algorithm is then investigated by considering inviscid flow past a circular cylinder. Validation of the finite element formulation via comparisons with experimental data for high‐Mach number perfect gas laminar flows is presented, with a specific focus on comparisons with experimentally measured skin friction and convective heat transfer on a 15° compression ramp. Copyright © 2007 John Wiley & Sons, Ltd.     

Stream function solution of Navier-Stokes problems with inter-element penalties

In this note, we apply a finite element stream function formulation with inter-element penalties to the Navier-Stokes equations. The approach is an extension of a technique previously introduced for Stokes, flow. The solution is obtained by iterative linearization using successive approximation, and results for a standard numerical test case are given.     

A framework for user equilibrium dynamic traffic assignment

Several analytic approaches have been developed to describe or predict traffic flows on networks with time-varying (dynamic) travel demands, flows and travel times. A key component of these models lies in modelling the flows and/or travel times on the individual links, but as this is made more realistic or accurate it tends to make the overall model less computationally tractable. To help overcome this, and for other reasons, we develop a bi-level user equilibrium (UE) framework that separates the assignment or loading of flows on the time–space network from the modelling of flows and trip times within individual links. We show that this model or framework satisfies appropriate definitions of UE satisfies a first-in-first-out (FIFO) property of road traffic, and has other desirable properties. The model can be solved by iterating between (a) a linear network-loading model that takes the lengths of time–space links as fixed (within narrow ranges), and (b) a set of link flow sub-models which update the link trip times to construct a new time–space network. This allows links to be processed sequentially or in parallel and avoids having to enumerate paths and compute path flows or travel times. We test and demonstrate the model and algorithms using example networks and find that the algorithm converges quickly and the solutions behave as expected. We show how to extend the model to handle elastic demands, multiple destinations and multiple traffic types, and traffic spillback within links and from link to link.